n = int(input())
dp = [[[1 for _ in range(2*n+1)] for _ in range(n)] for _ in range(2)]  # 2行n列
MODE = int(1e9+7)
# 第i步达到该点的方案数目
for step in range(1,2*n+1):
    for i in range(2):
        for j in range(n):
            for nx,ny in [(i+1,j),(i-1,j),(i,j+1),(i,j-1),(i-1,j-1),(i-1,j+1),(i+1,j-1),(i+1,j+1)]:
                if nx < 0 or nx >= 2: continue
                if ny < 0 or ny >= n: continue
                dp[i][j][step] += dp[nx][ny][step-1]
                dp[i][j][step] %= MODE
ans = 0
for i in range(2):
    for j in range(n):
        ans += dp[i][j][2*n]
print(ans)